On Polynomials Counting Essentially Irreducible Maps

نویسندگان

چکیده

We consider maps on genus-$g$ surfaces with $n$ (labeled) faces of prescribed even degrees. It is known since work Norbury that, if one disallows vertices degree one, the enumeration such related to counting lattice point in moduli space curves labeled points and given by a symmetric polynomial $N_{g,n}(\ell_1,\ldots,\ell_n)$ face degrees $2\ell_1, \ldots, 2\ell_n$. generalize this restricting that are essentially $2b$-irreducible for $b\geq 0$, which loosely speaking means they not allowed possess contractible cycles length less than $2b$ each cycle required bound $2b$. The shown be again $\hat{N}_{g,n}^{(b)}(\ell_1,\ldots,\ell_n)$ dependence $b$. These polynomials satisfy (generalized) string dilaton equations, $g\leq 1$ uniquely determine them. proofs rely heavily substitution approach Bouttier Guitter planar surfaces.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Complexity of Exact Counting of Dynamically Irreducible Polynomials

We give an efficient algorithm to enumerate all sets of r ě 1 quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

متن کامل

On Counting Polynomials of Some Nanostructures

The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.

متن کامل

on counting polynomials of some nanostructures

the omega polynomial(x) was recently proposed by diudea, based on the length of stripsin given graph g. the sadhana polynomial has been defined to evaluate the sadhana index ofa molecular graph. the pi polynomial is another molecular descriptor. in this paper wecompute these three polynomials for some infinite classes of nanostructures.

متن کامل

Computational experiences on the distances of polynomials to irreducible polynomials

In this paper we deal with a problem of Turán concerning the ‘distance’ of polynomials to irreducible polynomials. Using computational methods we prove that for any monic polynomial P ∈ Z[x] of degree ≤ 22 there exists a monic polynomial Q ∈ Z[x] with deg(Q) = deg(P ) such that Q is irreducible over Q and the ‘distance’ of P and Q is ≤ 4.

متن کامل

Counting maps on doughnuts

Abstract. How many maps with V vertices and E edges can be drawn on a doughnut with G holes? I solved this problem for doughnuts with up to 10 holes, and my colleagues Alain Giorgetti and Alexander Mednykh counted maps by number of edges alone on doughnuts with up to 11 holes. This expository paper outlines, in terms meant to be understandable by a nonspecialist, the methods we used and those u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Combinatorics

سال: 2022

ISSN: ['1077-8926', '1097-1440']

DOI: https://doi.org/10.37236/9746